Distribution-free tests for polynomial regression based on simplicial depth
نویسندگان
چکیده
منابع مشابه
Distribution-free tests for polynomial regression based on simplicial depth
A general approach for developing distribution free tests for general linear models based on simplicial depth is presented. In most relevant cases, the test statistic is a degenerated U-statistic so that the spectral decomposition of the conditional expectation of the kernel function is needed to derive the asymptotic distribution. A general formula for this conditional expectation is derived. ...
متن کاملTests for multiple regression based on simplicial depth
A general approach for developing distribution free tests for general linear models based on simplicial depth is applied to multiple regression. The tests are based on the asymptotic distribution of the simplicial regression depth, which depends only on the distribution law of the vector product of regressor variables. Based on this formula, the spectral decomposition and thus the asymptotic di...
متن کاملCalculation of simplicial depth estimators for polynomial regression with application to tests in shape analysis
A fast algorithm for calculating the simplicial depth of a single parameter value of a polynomial regression model and for calculating the maximum simplicial depth within an affine subspace of the parameter space or a polyhedron is presented. Since the maximum simplicial depth estimator is not unique, l1 and l2 methods are used to make the estimator unique. This estimator is compared with other...
متن کاملDistribution - Free Tests in Binary Regression Models
SUMMARY This paper proposes the use of Wilcoxon rank sum, Wilcoxon signed rank, and sign statistics for testing certain hypotheses representing zero effects in the linear logistic regression model. A simulation study provides insight into the alternatives for which each test is most powerful. An example with rea 1 data is gi ven for each tes t.
متن کاملOn algorithms for simplicial depth
Simplicial depth is a way to measure how deep a point is among a set of points. EEcient algorithms to compute it are important to the usefulness of its applications, such as in multivariate analysis in statistics. A straightforward method takes O(n d+1) time when the points are in d-dimensional space. We discuss an algorithm that takes O(n 2) time when the points are in three-dimensional space,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2009
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2008.06.009